Symmetric vertex models on planar random graphs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetric Vertex Models on Planar Random Graphs

We discuss a 4-vertex model on an ensemble of 3-valent (Φ) planar random graphs, which has the effect of coupling the vertex model to 2D quantum gravity. The regular lattice equivalent of the model is the symmetric 8-vertex model on the honeycomb lattice, which can be mapped on to an Ising model in field, as was originally shown by Wu et.al. using generalised weak graph transformation technique...

متن کامل

On the vertex-arboricity of planar graphs

The vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set of vertices of G can be partitioned so that each subset induces a forest. It is well-known that a(G) ≤ 3 for any planar graph G. In this paper we prove that a(G) ≤ 2 whenever G is planar and either G has no 4-cycles or any two triangles of G are at distance at least 3. c © 2007 Elsevier Ltd. All rights r...

متن کامل

Vertex Degrees in Planar Graphs

For a planar graph on n vertices we determine the maximum values for the following: 1) the sum of the m largest vertex degrees. 2) the number of vertices of degree at least k. 3) the sum of the degrees of vertices with degree at least k.

متن کامل

On Vertex, Edge, and Vertex-Edge Random Graphs (Extended Abstract)

We consider three classes of random graphs: edge random graphs, vertex random graphs, and vertex-edge random graphs. Edge random graphs are Erdős-Rényi random graphs [9, 10], vertex random graphs are generalizations of geometric random graphs [21], and vertex-edge random graphs generalize both. The names of these three types of random graphs describe where the randomness in the models lies: in ...

متن کامل

On Vertex, Edge, and Vertex-edge Random Graphs

We consider three classes of random graphs: edge random graphs, vertex random graphs, and vertex-edge random graphs. Edge random graphs are Erdős-Rényi random graphs [8, 9], vertex random graphs are generalizations of geometric random graphs [20], and vertexedge random graphs generalize both. The names of these three types of random graphs describe where the randomness in the models lies: in th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physics Letters B

سال: 1999

ISSN: 0370-2693

DOI: 10.1016/s0370-2693(99)00948-x